The orienteering problem with variable profits
نویسندگان
چکیده
منابع مشابه
The orienteering problem with variable profits
This paper introduces, models and solves a generalization of the Orienteering Problem, called the The Orienteering Problem with Variable Profits (OPVP). The OPVP is defined on a complete undirected graph G = (V,E), with a depot at vertex 0. Every vertex i ∈ V \ {0} has a profit pi to be collected, and an associated collection parameter αi ∈ [0, 1]. The vehicle may make a number of “passes”, col...
متن کاملOrienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs
Nowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract customer’s satisfaction and maximize profits. In this paper, the orienteering problem with variable profits, fractional objective func...
متن کاملThe orienteering problem with stochastic profits
Given a graph G = (N, E), N representing the set of nodes associated with Normally distributed random profits and E representing the set of edges with associated travel times, we define the Orienteering Problem with Stochastic Profits (OPSP) as the problem of finding a tour that visits a subset of N within a prespecified time limit and maximizes the probability of collecting more than a prespec...
متن کاملTeam Orienteering Problem with Decreasing Profits
Team Orienteering with Decreasing Profits (DP-TOP) extends the classical Team Orienteering problem (TOP) by considering the profit of each client as a decreasing function of time. It consists of maximizing the sum of collected profit by a fixed number K of vehicles, visiting each client at most once. In this work, we present lower bounds based on a Dantzig-Wolfe decomposition and column generat...
متن کاملThe probabilistic orienteering problem
The probabilistic orienteering problem (POP) is defined on a directed graph where a cost is associated with each arc and a prize is associated with each node. Moreover, each node will be available for visit only with a certain probability. A server starts from a fixed origin, has a given time limit to visit a subset of nodes, and ends at a fixed destination. In a first stage, a node subset has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2013
ISSN: 0028-3045
DOI: 10.1002/net.21496